Iterative Solution of Weighted Linear Least Squares Problems
نویسندگان
چکیده
منابع مشابه
An iterative solution of weighted total least-squares adjustment
Total least-squares (TLS) adjustment is used to estimate the parameters in the errors-in-variables (EIV) model. However, its exact solution is rather complicated, and the accuracies of estimated parameters are too difficult to analytically compute. Since the EIV model is essentially a non-linear model, it can be solved according to the theory of non-linear least-squares adjustment. In this cont...
متن کاملAccurate Solution of Weighted Least Squares by Iterative Methods
We consider the weighted least-squares (WLS) problem with a very ill-conditioned weight matrix. Weighted least-squares problems arise in many applications including linear programming, electrical networks, boundary value problems, and structures. Because of roundoo errors, standard iterative methods for solving a WLS problem with ill-conditioned weights may not give the correct answer. Indeed, ...
متن کاملPreconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems
We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algori...
متن کاملStopping Criteria for the Iterative Solution of Linear Least Squares
We explain an interesting property of minimum residual iterative methods for the solution of the linear least squares (LS) problem. Our analysis demonstrates that the stopping criteria commonly used with these methods can in some situations be too conservative, causing any chosen method to perform too many iterations or even fail to detect that an acceptable iterate has been obtained. We propos...
متن کاملSolution of large-scale weighted least-squares problems
A sequence of least squares problems of the form miny kG1=2(AT y h)k2, where G is an n n positive definite diagonal weight matrix, and A anm n (m n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low-rank correction preconditioners for such problems, and a mixed solver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2020
ISSN: 1844-0835
DOI: 10.2478/auom-2020-0019